Critical Strategies Under Approval Voting: Who Gets Ruled In And Ruled Out
نویسنده
چکیده
We introduce the notion of a “critical strategy profile” under approval voting (AV), which facilitates the identification of all possible outcomes that can occur under AV. Included among AV outcomes are those given by scoring rules, single transferable vote, the majoritarian compromise, Condorcet systems, and others as well. Under each of these systems, a Condorcet winner may be upset through manipulation by individual voters or coalitions of voters, whereas AV ensures the election of a Condorcet winner as a strong Nash equilibrium wherein voters use sincere strategies. To be sure, AV may also elect Condorcet losers and other lesser candidates, sometimes in equilibrium. This multiplicity of (equilibrium) outcomes is the product of a social-choice framework that is more general than the standard preference-based one. From a normative perspective, we argue that voter judgments about candidate acceptability should take precedence over the usual social-choice criteria, such as electing a Condorcet or Borda winner.
منابع مشابه
Characterizations of Slant Ruled Surfaces in the Euclidean 3-space
In this study, we give the relationships between the conical curvatures of ruled surfaces generated by the unit vectors of the ruling, central normal and central tangent of a ruled surface in the Euclidean 3-space E^3. We obtain differential equations characterizing slant ruled surfaces and if the reference ruled surface is a slant ruled surface, we give the conditions for the surfaces generate...
متن کاملApproval Voting on Large Poisson Games ∗
Approval Voting is analyzed in a context of large elections with strategic voters, the Myerson’s Large Poisson Games. Three examples show that this voting rule does not always correctly aggregate preferences. The first one shows that a candidate ranked first by more than half of the voters need not be the Winner of the election under Approval voting. In the second one, we show that it can be th...
متن کاملComputational Aspects of Approval Voting and Declared-strategy Voting
OF THE DISSERTATION Computational Aspects of Approval Voting and Declared-Strategy Voting by Robert Hampton LeGrand III May 2008 Washington University St. Louis, Missouri Professor Ron K. Cytron, Chairperson Computational social choice is a relatively new discipline that explores issues at the intersection of social choice theory and computer science. Designing a protocol for collective decisio...
متن کاملVoting Early and Often Can Be a Good Thing
The current political climate has almost ruled out the use of Internet voting. Many politicians, led by vocal computer scientists, are pushing for voter verified paper receipts; which is likely to push us even further away from even electronic voting systems. On the other hand, cryptographers have created homomorphic encryption and non-interactive zero-knowledge proofs with features that can su...
متن کاملStump COMPUTATIONAL ASPECTS OF APPROVAL VOTING AND DECLARED - STRATEGY VOTING
COMPUTATIONAL ASPECTS OF APPROVAL VOTING AND DECLARED-STRATEGY VOTING by Robert Hampton LeGrand III ADVISOR: Professor Ron K. Cytron December, 2007 St. Louis, Missouri Designing a protocol for collective decision-making is made difficult by the possibility of manipulation through insincere voting. The traditional plurality system suffers from this problem; approval voting addresses it by allowi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005